The Symmetric Assignment Problem
نویسنده
چکیده
A branch and bound algorithm for finding the minimal cost symmetric assignment is discussed. The matching problem in graph theory and the Chinese postman puzzle are all special cases of the symmetric assignment problem, and hence this algorithm can be applied to solve them.
منابع مشابه
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملTHE SYMMETRIC ASSIGNMENT PROBLEM by Katta
A branch and bound algorithm for finding the minimal cost symmetric assignment is discussed. The matching problem in graph theory and the Chinese postman puzzle are all special cases of the symmetric assignment problem, and hence this algorithm can be applied to solve them.
متن کاملBox-inequalities for quadratic assignment polytopes
Linear Programming based lower bounds have been considered both for the general as well as for the symmetric quadratic assignment problem several times in the recent years. Their quality has turned out to be quite good in practice. Investigations of the polytopes underlying the corresponding integer linear programming formulations (the non-symmetric and the symmetric quadratic assignment polyto...
متن کاملSystem Assignment and Pole Placement for Symmetric Realisations
In this paper we consider the problem of system assignment for the class of linear output feedback systems having symmetric state space realisations. For such systems the classical pole placement task can be considered as a degenerate case of a more general system assignment problem. It is shown that a symmetric state space realisation can be assigned arbitrary (real) poles via output feedback ...
متن کاملA New Model for Fleet Assignment Problem, Case Study of Iran Air Network at Vision 2036
The fleet assignment problem (FAP) assigns the type of airplane at each flight segment. Since airplane is an expensive resource, poor fleet assignment can cause a great increase in costs of airlines. There are so many consideration which should be tackled in formulation of a FAP problem, especially the parameters regarding to the airplanes. This paper presents a novel, mixed integer programing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015